H-triangles with k interior H-points
نویسندگان
چکیده
An H -triangle is a triangle with corners in the set of vertices of a tiling of R2 by regular hexagons of unit edge. It is known that any H -triangle with exactly 1 interior H -point can have at most 10 H -points on its boundary. In this note we prove that any H -triangle with exactly k interior H -points can have at most 3k+7 boundary H -points. Moreover we form two conjectures dealing with H -polygons. c © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Grid Embedding of Internally Triangulated Plane Graphs without Non-empty Triangles
A straight line grid embedding of a plane graph G is a drawing of G such that the vertices are drawn at grid points and the edges are drawn as non-intersecting straight line segments. In this paper, we show that, if an internally triangulated plane graph G has no non-empty triangles (a non-empty triangle is a triangle of G containing some vertices in its interior), then G can be embedded on a g...
متن کاملOn the Existence of a Point Subset with 4 or 5 Interior Points
1 Abstract An interior point of a nite planar point set is a point of the set that is not on the boundary of the convex hull of the set. For any integer k 1, let h(k) be the smallest integer such that every set of points in the plane, no three collinear, containing at least h(k) interior points has a subset of points containing k or k +1 interior points. We proved that h(3) = 3 in an earlier pa...
متن کاملAutomatic Construction of Quality Nonobtuse Boundary And/or Interface Delaunay Triangulations the Control Volume Methods
In this paper we discuss a new algorithm that for any input quality constrained Delaunay triangulation with minimum interior angle greater than or equal to 30 , produces a quality nonobtuse boundary and/or interface Delaunay triangulation by the Delaunay insertion of a nite number of boundary and/or interface points. A boundary (interface) obtuse triangle is a triangle that has an obtuse angle ...
متن کاملOn Tensor Product of Graphs, Girth and Triangles
The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
متن کاملOn edge-disjoint empty triangles of point sets
Let P be a set of points in the plane in general position. Any three points x, y, x 2 P determine a triangle (x, y, z) of the plane. We say that (x, y, z) is empty if its interior contains no element of P . In this paper we study the following problems: What is the size of the largest family of edge-disjoint triangles of a point set? How many triangulations of P are needed to cover all the empt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008